School of Computer Engineeringcorelab
DATA STRUCTURES LAB
CSS 2111
Syllabus
- 01Solving Problems Using Arrays, Pointers and Dynamic Memory Allocation Functions
- 02Ragged Arrays, Structures
- 03Solving Problems Using Recursion (Sorting And Searching)
- 04Linked List Concepts - Singly And Doubly Linked Lists
- 05Circular Singly And Circular Doubly Linked Lists
- 06Linked List Applications
- 07Implementation of Stack Using Arrays And Linked Lists
- 08Stack Applications
- 09Implementation of Queue Using Arrays And Linked Lists
- 10Queue Applications
- 11Tree Concepts - Binary Tree And Binary Search Tree
- 12AVL Tree
- 13Tree Applications
References
- Behrouz A. Forouzan, Richard F. Gilberg, A Structured Programming Approach Using C,(3e), Cengage Learning India Pvt. Ltd, India, 2007.
- Ellis Horowitz, Sartaj Sahani, Susan Anderson and Freed, Fundamentals of Data Structures in C, (2e), Silicon Press, 2007.
- Richard F. Gilberg, Behrouz A. Forouzan, Data structures, A Pseudocode Approach with C, (2e), Cengage Learning India Pvt. Ltd, India, 2009.
- Tenenbaum Aaron M., Langsam Yedidyah, Augenstein Moshe J., Data structures using C, Pearson Prentice Hall of India Ltd., 2007.
- Debasis Samanta, Classic Data Structures, (2e), PHI Learning Pvt. Ltd., India, 2010.
Credits Structure
0Lecture
0Tutorial
3Practical
1Total